Path graph

Results: 1083



#Item
51Graph theory / Mathematics / NP-complete problems / Matroid theory / Steiner tree problem / Bipartite graph / Eulerian path / Graph / Degree / Ear decomposition / Directed graph / Cycle

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-18 01:28:39
52Graph theory / Mathematics / Eulerian path / Tree / Cycle / Degree / Vertex / Graph / Ear decomposition / Cycle space / Pathwidth

NEW PROXIMITY-PRESERVING ORDERINGS FOR SPATIAL DATA Alan Saalfeld Bureau of the Census1 Washington, DC 20233

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-29 21:44:38
53Network theory / Mathematics / Graph theory / Discrete mathematics / Networks / Network analysis / Betweenness centrality / Centrality / Association rule learning / Eli Upfal / Shortest path problem

Abstract of “Sampling-based Randomized Algorithms for Big Data Analytics” by Matteo Riondato, Ph.D., Brown University, MayAnalyzing huge datasets becomes prohibitively slow when the dataset does not fit in mai

Add to Reading List

Source URL: matteo.rionda.to

Language: English - Date: 2016-07-30 12:22:15
54Graph theory / NP-complete problems / Longest path problem / Interval graph / Hamiltonian path / Independent set / Chordal graph / Indifference graph / Path / Permutation graph / Pathwidth / Graph coloring

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-06-12 14:16:54
55Graph theory / Planar graphs / SPQR tree / 1-planar graph / Ear decomposition / Hamiltonian path / Tree / Outerplanar graph / Line graph

Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1 University of Sydney, Australia

Add to Reading List

Source URL: www.amp.i.kyoto-u.ac.jp

Language: English - Date: 2014-09-07 19:39:32
56Graph theory / Graph operations / Claw-free graph / Matching / Interval graph / Line graph / Triangle-free graph / Indifference graph / Perfect graph

The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:35
57Graph theory / Information science / Information retrieval / Search algorithms / Routing algorithms / Combinatorial optimization / Game artificial intelligence / A* search algorithm / Query optimization / Path / PubMed / Best-first search

Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Add to Reading List

Source URL: webdb2004.cs.columbia.edu

Language: English - Date: 2004-05-31 19:36:24
58NP-complete problems / Circular-arc graph / Longest path problem / Hamiltonian path / Interval graph / Intersection graph / Independent set / Graph theory / Pathwidth / Trapezoid graph

Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2011-12-14 14:46:08
59NP-complete problems / Graph theory / Network theory / Edsger W. Dijkstra / Shortest path problem / Maximal independent set / Independent set / Matching / Bipartite graph / Degree / Graph / Line graph

On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2014-04-14 14:04:38
60Network theory / NP-complete problems / Edsger W. Dijkstra / Graph coloring / Spanning tree / Matching / Shortest path problem / Logical matrix / Treewidth / Matrix / Minimum spanning tree / Clique

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11
UPDATE